Weak faithfulness properties for the Burau representation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Faithfulness Properties for the Burau Representation

We study the components of the matrices that belong to the image of the Burau representation of braids, and establish both algebraic and order constraints for a given Laurent polynomial possibly be a component of such a Burau matrix. As an application partial faithfulness results for the Burau representation are deduced. AMS Classification: 20F36, 20H25, 15A24, 57M05.

متن کامل

The Faithfulness Question for the Burau Representation

We consider the Burau and Gassner representations of the braid groups B„ . A sufficient condition for faithfulness, involving just a pair of arcs, is shown to be necessary as well for all but at most two values of n. In the Burau case, this implies nonfaithfulness for n > 10 . Alexander showed in [6] that any knot K can be made by connecting the ends of some braid b. The Alexander polynomial A(...

متن کامل

Cabling Burau Representation

The Burau representation enables to define many other representations of the braid group Bn by the topological operation of “cabling braids”. We show here that these representations split into copies of the Burau representation itself and of a representation of Bn/(Pn, Pn). In particular, we show that there is no gain in terms of faithfulness by cabling the Burau representation.

متن کامل

Entropy and the Burau Representation

The topological entropy of a braid is the infimum of the entropies of all homeomor-phisms of the disc which have a finite invariant set represented by the braid. When the isotopy class represented by the braid is pseudo-Anosov or is reducible with a pseudo-Anosov component, this entropy is positive. Fried and Kolev proved that the entropy is bounded below by the logarithm of the spectral radius...

متن کامل

A Generalized Burau Representation for String Links

A 2-variable matrix B ∈ GLn(Z[u±1, v±1]) is defined for any n-string link, generalizing the Burau matrix of an nbraid. The specialization u = 1, v = t−1 recovers the generalized Burau matrix recently defined by X. S. Lin, F. Tian and Z. Wang using probabilistic methods. The specialization u = t−1, v = 1 results in a matrix with a natural algebraic interpretation, and one that yields homological...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 1996

ISSN: 0166-8641

DOI: 10.1016/0166-8641(95)00078-x